package com.wc.alorithm_blue_bridge._模拟.Q7940;

import java.util.HashSet;
import java.util.Scanner;

/**
 * @Author congege
 * @Description 最后的元音
 * https://www.lanqiao.cn/problems/7940/learning/?problem_list_id=25&page=1
 * @Date Created in 2023/12/19-23:30
 */
public class Main {
    static char[] chs = new char[]{'a', 'e', 'i', 'o', 'u'};

    public static void main(String[] args) {
        HashSet<Character> set = new HashSet<>();
        for (int i = 0; i < chs.length; i++) {
            set.add(chs[i]);
        }
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        int len = s.length();
        for (int i = len - 1; i >= 0; i--) {
            if (set.contains(s.charAt(i))) {
                System.out.println(s.charAt(i));
                break;
            }
        }
    }
}
